Algebraic theory of probabilistic processes
نویسندگان
چکیده
منابع مشابه
Algebraic Meta-Theory of Processes with Data
There exists a rich literature of rule formats guaranteeing different algebraic properties for formalisms with a Structural Operational Semantics (SOS). Moreover, there exist a few approaches for automatically deriving axiomatizations characterizing strong bisimilarity of processes. To our knowledge, this literature has never been extended to the setting with data (e.g. to model storage and mem...
متن کاملAn Algebraic Theory of Epistemic Processes
In the past few years, several process-algebraic frameworks have been proposed that incorporate the notion of epistemic knowledge. These frameworks allow for reasoning about knowledge-related properties, such as anonymity, secrecy and authentication, in the operational specifications given in process-algebraic languages. Hitherto, no sound and (ground-)complete axiomatization has been given for...
متن کاملAnalysis of Probabilistic Processes and Automata Theory
This chapter surveys some basic algorithms for analyzing Markov chains (MCs) and Markov decision processes (MDPs), and discusses their computational complexity. We focus on discrete-time processes, and we consider both finite-state models as well as countably infinite-state models that are finitely-presented. The analyses we will primarily focus on are hitting (reachability) probabilities and ω...
متن کاملProbabilistic Theory of Transport Processes with Polarization
We derive a probabilistic representation for solutions of matrix-valued transport equations that account for polarization e ects. Such equations arise in radiative transport for the Stokes parameters that model the propagation of light through turbulent atmospheres. They also arise in radiative transport for seismic wave propagation in the earth's crust. The probabilistic representation involve...
متن کاملTowards an Algebraic Theory of Typed Mobile Processes
The impact of types on the algebraic theory of the π-calculus is studied. The type system has capability types. They allow one to distinguish between the ability to read from a channel, to write to a channel, and both to read and to write. They also give rise to a natural and powerful subtyping relation. Two variants of typed bisimilarity are considered, both in their late and in their early ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2003
ISSN: 1567-8326
DOI: 10.1016/s1567-8326(02)00069-3